A Study of the Combination of Variation Operators in the NSGA-II Algorithm

Multi-objective evolutionary algorithms rely on the use of variation operators as their basic mechanism to carry out the evolutionary process. These operators are usually fixed and applied in the same way during algorithm execution, e.g., the mutation probability in genetic algorithms. This paper analyses whether a more dynamic approach combining different operators with variable application rate along the search process allows to improve the static classical behavior. This way, we explore the combined use of three different operators (simulated binary crossover, differential evolution’s operator, and polynomial mutation) in the NSGA-II algorithm. We have considered two strategies for selecting the operators: random and adaptive. The resulting variants have been tested on a set of 19 complex problems, and our results indicate that both schemes significantly improve the performance of the original NSGA-II algorithm, achieving the random and adaptive variants the best overall results in the bi- and three-objective considered problems, respectively.UNIVERSIDAD DE MÁLAGA. CAMPUS DE EXCELENCIA INTERNACIONAL ANDALUCÍA TEC

MO-MFCGA: Multiobjective multifactorial cellular genetic algorithm for evolutionary multitasking

Multiobjetive optimization has gained a considerable momentum in the evolutionary computation scientific community. Methods coming from evolutionary computation have shown a remarkable performance for solving this kind of optimization problems thanks to their implicit parallelism and the simultaneous convergence towards the Pareto front. In any case, the resolution of multiobjective optimization problems (MOPs) from the perspective of multitasking optimization remains almost unexplored. Multitasking is an incipient research stream which explores how multiple optimization problems can be simultaneously addressed by performing a single search process. The main motivation behind this solving paradigm is to exploit the synergies between the different problems (or tasks) being optimized. Going deeper, we resort in this paper to the also recent paradigm Evolutionary Multitasking (EM). We introduce the adaptation of the recently proposed Multifactorial Cellular Genetic Algorithm (MFCGA) for solving MOPs, giving rise to the Multiobjective MFCGA (MO-MFCGA). An extensive performance analysis is conducted using the Multiobjective Multifactorial Evolutionary Algorithm as comparison baseline. The experimentation is conducted over 10 multitasking setups, using the Multiobjective Euclidean Traveling Salesman Problem as benchmarking problem. We also perform a deep analysis on the genetic transferability among the problem instances employed, using the synergies among tasks aroused along the MO-MFCGA search procedure

Metaheuristic approaches for optimal broadcasting design in metropolitan MANETs

11th International Conference on Computer Aided Systems Theory. Las Palmas de Gran Canaria, Spain, February 12-16, 2007Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenario, broadcasting becomes an operation of tremendous importance for the own existence and operation of the network. Optimizing a broadcasting strategy in MANETs is a multiobjective problem accounting for three goals: reaching as many stations as possible, minimizing the network utilization, and reducing the duration of the operation itself. This research, which has been developed within the OPLINK project (http://oplink.lcc.uma.es), faces a wide study about this problem in metropolitan MANETs with up to seven different advanced multiobjective metaheuristics. They all compute Pareto fronts of solutions which empower a human designer with the ability of choosing the preferred configuration for the network. The quality of these fronts is evaluated by using the hypervolume metric. The obtained results show that the SPEA2 algorithm is the most accurate metaheuristic for solving the broadcasting problem.Publicad

Solving a Real-World Structural Optimization Problem With a Distributed SMS-EMOA Algorithm

This paper addresses a real-world optimization problem in civil engineering. It lies in the dimensioning of a 162m long bridge composed of 1584 bars so that both its weight and its deformation are to be minimized. Evaluating each possible configuration of the bridge takes several seconds and, as a consequence, running a metaheuristic for several thousands of evaluations would require many days on one single processor. Our approach has been to develop a distributed master/worker version of SMS-EMOA, an indicator-based multiobjective algorithm. By combining the Java implementation of the algorithm in jMetal with the Condor distributed scheduler, we have been able to use more than 350 cores to obtain accurate results in a reasonable amount of time.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

On the automatic design of multi‑objective particle swarm optimizers: experimentation and analysis.

Research in multi-objective particle swarm optimizers (MOPSOs) progresses by proposing one new MOPSO at a time. In spite of the commonalities among different MOPSOs, it is often unclear which algorithmic components are crucial for explaining the performance of a particular MOPSO design. Moreover, it is expected that different designs may perform best on different problem families and identifying a best overall MOPSO is a challenging task. We tackle this challenge here by: (1) proposing AutoMOPSO, a flexible algorithmic template for designing MOPSOs with a design space that can instantiate thousands of potential MOPSOs; and (2) searching for good-performing MOPSO designs given a family of training problems by means of an automatic configuration tool (irace). We apply this automatic design methodology to generate a MOPSO that significantly outperforms two state-of-the-art MOPSOs on four well-known bi-objective problem families. We also identify the key design choices and parameters of the winning MOPSO by means of ablation. FAutoMOPSO is publicly available as part of the jMetal framework.Funding for open access charge: Universidad de Málaga / CBU

Metaheuristics for multiobjective combinatorial optimization: review and recent issues

Ce document présente certaines voies prometteuses, émergent actuellement dans le domaine de l\u27optimisation combinatoire multiobjectif. Résoudre de tels problèmes implique notamment la recherche d\u27un ensemble de solutions dites Pareto optimales\u27\u27. Ces solutions sont les meilleurs compromis réalisable pour les différents objectifs à optimiser pour le problème étudié, le but étant de découvrir un ensemble de bonne qualité en terme de convergence, mais également en terme de diversité des compromis proposés. Dans le domaine des métaheuristiques, il existe plusieurs état de l\u27art du domaine traitant principalement des algorithmes évolutionnaires. Nous nous proposons ici d\u27enrichir ces études en relevant des approches récentes qui ont fait preuve d\u27innovation mais également de bons résultats. Aprés une introduction générale et avoir proposé une classification des méthodes usuelles, nous nous proposons de discuter des orientations récentes et prometteuses de la recherche dans ce domaine. Les approches étudiées sont l\u27application des métaheuristues mono-objectif récentes au cadre multi-objectif, les métaheuristiques hybrides, les métaheuristiques multi-objectif et le parallèlisme, et enfin l\u27optimisation multi-objectif sous incertitude. Nous concluerons par une discussion et quelques questions ouvertes

Image Signal Processor parameter tuning with surrogate-assisted Particle Swarm Optimization

International audienceEvolutionary algorithms (EA) are developed and compared based on well defined benchmark problems, but their application to real-world problems is still challenging. In image processing, EA have been used to tune a particular image filter or in the design of filters themselves. But nowadays in digital cameras, the image sensor captures a raw image that is then processed by an Image Signal Processor (ISP) where several transformations or filters are sequentially applied in order to enhance the final picture. Each of these steps have several parameters and their tuning require lot of resources that are usually performed by human experts based on metrics to assess the quality of the final image. This can be considered as an expensive black-box optimization problem with many parameters and many quality metrics. In this paper, we investigate the use of EA in the context of ISP parameter tuning with the aim of raw image enhancement